package TestDemo;

import java.util.*;

class Student implements Comparable<Student> {
    public int sc;
    public int pat;
    @Override
    public int compareTo(Student o) {
        if (this.sc != o.sc) return this.sc - o.sc;
        return this.pat - o.pat;
    }

    public Student(int sc, int pat) {
        this.sc = sc;
        this.pat = pat;
    }
}

public class TestDemo {
    public static void main(String[] args) {
        HashMap<Student, Integer> m = new HashMap<>();
        Student student1 = new Student(10,20);
        Student student2 = new Student(20,30);
        m.put(student1, 1);
        m.put(student1, 2
    }
    public static void main1(String[] args) {
        PriorityQueue<Student> heap = new PriorityQueue<>();
        HashMap<Student, Integer> m = new HashMap<>();
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int s = sc.nextInt();
        while (n > 0)
        {
            n--;
            int score = sc.nextInt();
            int pat = sc.nextInt();
            if (score < 175) continue;
            Student student = new Student(score, pat);
            heap.offer(student);
            if (m.get(student) == null) {
                int val = m.get(student);

            }
        }
    }
}
